Recent Developments in Explicit Constructions of Extractors
نویسنده
چکیده
Extractors are functions which are able to “extract” random bits from arbitrary distributions which “contain” sufficient randomness. Explicit constructions of extractors have many applications in complexity theory and combinatorics. This manuscript is a survey of recent developments in extractors and focuses on explicit constructions of extractors following Trevisan’s breakthrough result [Tre99].
منابع مشابه
Towards Optimal Randomness Extractors and Ramsey Graphs
I will survey some of the recent exciting progress on explicit constructions of randomness extractors for independent sources. Many of the new constructions rely on explicit constructions of newly introduced pseudorandom primitives, and there remains scope of finding better explicit constructions of these primitives. I will also discuss some possible approaches for constructing optimal Ramsey g...
متن کاملOn the Error Parameter of Dispersers
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in some parameters. Our constructions are not strong, but we show that having such explicit strong constructions implies a solution to the Ramsey graph construction problem.
متن کاملOn the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors
Weak designs were defined in [10] and are used in constructions of extractors. Roughly speaking, a weak design is a collection of subsets satisfying some near-disjointness properties. Constructions of weak designs with certain parameters are given in [10]. These constructions are explicit in the sense that they require time and space polynomial in the number of subsets. However, the constructio...
متن کاملExtracting Randomness: A Survey and New Constructions
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related ``dispersers,'' exhibit some of the most ``random-like'' properties of explicitly constructed combinatorial structures. In this paper we do two things. First, we survey extractors and ...
متن کاملAn Introduction to Randomness Extractors
We give an introduction to the area of “randomness extraction” and survey the main concepts of this area: deterministic extractors, seeded extractors and multiple sources extractors. For each one we briefly discuss background, definitions, explicit constructions and applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 77 شماره
صفحات -
تاریخ انتشار 2002